Bidtree Ordering in IDA* Combinatorial Auction Winner-Determination with Side Constraints
نویسندگان
چکیده
We extend Sandholm’s bidtree-based IDA* algorithm for combinatorial auction winner determination to deal with negotiation over tasks with precedence constraints. We evaluate its performance, and show that the order of items in the bidtree has a major impact on performance. Specifically, performance is enhanced if the items with the largest numbers of bids are at the top of the bidtree. This is due to the fact that the effective branching factor in the search tree is controlled by the number of bids returned from a query to the bidtree, which in turn is strongly related to its construction.
منابع مشابه
MAGNET: A Multi-Agent System using Auctions with Temporal and Precedence Constraints⋆
We consider the problem of rational, self-interested, economic agents who must negotiate with each other in order to carry out their plans. Customer agents express their plans in the form of task networks with temporal and precedence constraints. The market runs a combinatorial reverse auction, in which supplier agents submit bids specifying prices for combinations of tasks, along with time win...
متن کاملSelecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction
In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملOn the Sensitivity of Incremental Algorithms for Combinatorial Auctions
Despite the large amounts of runtime needed to adequately solve a combinatorial auction (CA), existing iterative CA auction protocols require winner determination during every round of bid submissions. Using existing algorithms for winner determination will cause a timing bottleneck during the winner determination phase. Furthermore, there has recently been work which models the formation of su...
متن کاملSolving Winner Determination Problem in Double Combinatorial Auction by ICA in Cloud Computing
There are many different ways to allocate resources in cloud computing. The economic methods are some of common ways to resource allocation. The auction-based method has some advantages compared with Fixed-Price method. The double combinatorial auction is one of the proper ways of resource allocation in cloud computing. Resource allocation in double combinatorial auction includes two phases. Th...
متن کامل